Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs
نویسندگان
چکیده
For any two 2-regular spanning subgraphs G and H of the complete multipartite graph K, necessary and sufficient conditions are found for the existence of a 2-factorization of K in which (1) the first and second 2-factors are isomorphic to G and H respectively, and (2) each other 2-factor is a hamilton cycle, in the case where K has an odd number of vertices.
منابع مشابه
Non-disconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
In this paper necessary and sufficient conditions are found for an edge-colored graph H to be the homomorphic image of a 2-factorization of a complete multipartite graph G in which each 2-factor of G has the same number of components as its corresponding color class in H. This result is used to completely solve the problem of finding hamilton decompositions of Ka,b−E(U) for any 2-factor U of Ka...
متن کاملVarious One-Factorizations of Complete Graphs
Methods to compute 1–factorizations of a complete graphs of even order are presented. For complete graphs where the number of vertices is a power of 2, we propose several new methods to construct 1–factorizations. Our methods are different from methods that make use of algebraic concepts such as Steiner triple systems, starters and all other existing methods. We also show that certain complete ...
متن کاملSharply Transitive 1-Factorizations of Complete Multipartite Graphs
Given a finite group G of even order, which graphs Γ have a 1−factorization admitting G as automorphism group with a sharply transitive action on the vertex-set? Starting from this question, we prove some general results and develop an exhaustive analysis when Γ is a complete multipartite graph and G is cyclic.
متن کاملBipartite 2-Factorizations of Complete Multipartite Graphs
It is shown that if K is any regular complete multipartite graph of even degree, and F is any bipartite 2-factor of K, then there exists a factorisation of K into F ; except that there is no factorisation of K6,6 into F when F is the union of two disjoint 6-cycles.
متن کاملMaximal sets of Hamilton cycles in complete multipartite graphs II
A set S of edge-disjoint hamilton cycles in a graph T is said to be maximal if the hamilton cycles in S form a subgraph of T such that T −E(S) has no hamilton cycle. The set of integers m for which a graph T contains a maximal set of m edge-disjoint hamilton cycles has previously been determined whenever T is a complete graph, a complete bipartite graph, and in many cases when T is a complete m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 24 شماره
صفحات -
تاریخ انتشار 2008